Efficient Dependence Analysis for Java Arrays
نویسندگان
چکیده
منابع مشابه
Supporting multidimensional arrays in Java
The lack of direct support for multidimensional arrays in JavaTM has been recognized as a major deficiency in the language’s applicability to numerical computing. It has been shown that, when augmented with multidimensional arrays, Java can achieve very high-performance for numerical computing through the use of compiler techniques and efficient implementations of aggregate array operations. Th...
متن کاملHigh Performance Computing in Java: Language and Compiler Issues
Poor performance on numerical codes has slowed adoption of Java within the technical computing community. In this paper we describe a prototype array library and a research prototype compiler that support standard Java and deliver near-Fortran performance on numerically intensive codes. We discuss in detail our implementation of: (i) an efficient Java package for true multidimensional arrays; (...
متن کاملHigh Performance Numerical Computing in Java: Language and Compiler Issues
Poor performance on numerical codes has slowed the adoption of Java within the technical computing community. In this paper we describe a prototype array library and a research prototype compiler that support standard Java and deliver near-Fortran performance on numerically intensive codes. We discuss in detail our implementation of: (i) an efficient Java package for true multidimensional array...
متن کاملIdentification of Heap-Carried Data Dependence Via Explicit Store Heap Models
Dependence information between program values is extensively used in many program optimization techniques. The ability to identify statements, calls and loop iterations that do not depend on each other enables many transformations which increase the instruction and thread-level parallelism in a program. When program variables contain complex data structures including arrays, records, and recurs...
متن کاملSigns and Formal Concepts
In this paper we propose a semiotic conceptual framework which is compatible with Peirce’s definition of signs and uses formal concept analysis for its conceptual structures. The goal of our research is to improve the use of formal languages such as ontology languages and programming languages. Even though there exist a myriad of theories, models and implementations of formal languages, in prac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001